Approximating Dependency Grammars Through Intersection of Regular Languages
Identifieur interne : 006304 ( Main/Exploration ); précédent : 006303; suivant : 006305Approximating Dependency Grammars Through Intersection of Regular Languages
Auteurs : Anssi Yli-Jyr [Finlande]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: The paper formulates projective dependency grammars in terms of constraints on a string based encoding of dependency trees and develops an approach to obtain a regular approximation for these grammars. In the approach, dependency analyses are encoded with balanced bracketing that encodes dependency relations among the words of the analyzed sentence. The brackets, thus, indicate dependencies rather than delimit phrases. The encoding allows expressing dependency rules (in the sense of Hays and Gaifman) using a semi-Dyck language and a so-called context restriction operation. When the semi-Dyck language in the representation is replaced with a regular restriction of it, we obtain an approximation for the original dependency grammar.
Url:
DOI: 10.1007/978-3-540-30500-2_26
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000601
- to stream Istex, to step Curation: 000596
- to stream Istex, to step Checkpoint: 001618
- to stream Main, to step Merge: 006529
- to stream Main, to step Curation: 006304
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Approximating Dependency Grammars Through Intersection of Regular Languages</title><author><name sortKey="Yli Jyr, Anssi" sort="Yli Jyr, Anssi" uniqKey="Yli Jyr A" first="Anssi" last="Yli-Jyr">Anssi Yli-Jyr</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:1AA9CF2BBB2BD4988AE34276DF6FD9D34B4BC3BB</idno><date when="2005" year="2005">2005</date><idno type="doi">10.1007/978-3-540-30500-2_26</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-1Z3H7NMS-P/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000601</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000601</idno><idno type="wicri:Area/Istex/Curation">000596</idno><idno type="wicri:Area/Istex/Checkpoint">001618</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001618</idno><idno type="wicri:doubleKey">0302-9743:2005:Yli Jyr A:approximating:dependency:grammars</idno><idno type="wicri:Area/Main/Merge">006529</idno><idno type="wicri:Area/Main/Curation">006304</idno><idno type="wicri:Area/Main/Exploration">006304</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Approximating Dependency Grammars Through Intersection of Regular Languages</title><author><name sortKey="Yli Jyr, Anssi" sort="Yli Jyr, Anssi" uniqKey="Yli Jyr A" first="Anssi" last="Yli-Jyr">Anssi Yli-Jyr</name><affiliation wicri:level="4"><country xml:lang="fr">Finlande</country><wicri:regionArea>Department of General Linguistics, University of Helsinki, P.O. Box 9, FIN-00014</wicri:regionArea><orgName type="university">Université d'Helsinki</orgName><placeName><settlement type="city">Helsinki</settlement><region type="région" nuts="2">Uusimaa</region></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Finlande</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The paper formulates projective dependency grammars in terms of constraints on a string based encoding of dependency trees and develops an approach to obtain a regular approximation for these grammars. In the approach, dependency analyses are encoded with balanced bracketing that encodes dependency relations among the words of the analyzed sentence. The brackets, thus, indicate dependencies rather than delimit phrases. The encoding allows expressing dependency rules (in the sense of Hays and Gaifman) using a semi-Dyck language and a so-called context restriction operation. When the semi-Dyck language in the representation is replaced with a regular restriction of it, we obtain an approximation for the original dependency grammar.</div></front></TEI><affiliations><list><country><li>Finlande</li></country><region><li>Uusimaa</li></region><settlement><li>Helsinki</li></settlement><orgName><li>Université d'Helsinki</li></orgName></list><tree><country name="Finlande"><region name="Uusimaa"><name sortKey="Yli Jyr, Anssi" sort="Yli Jyr, Anssi" uniqKey="Yli Jyr A" first="Anssi" last="Yli-Jyr">Anssi Yli-Jyr</name></region><name sortKey="Yli Jyr, Anssi" sort="Yli Jyr, Anssi" uniqKey="Yli Jyr A" first="Anssi" last="Yli-Jyr">Anssi Yli-Jyr</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 006304 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 006304 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:1AA9CF2BBB2BD4988AE34276DF6FD9D34B4BC3BB
|texte= Approximating Dependency Grammars Through Intersection of Regular Languages
}}
| This area was generated with Dilib version V0.6.33. |  |